An extension for dynamic lot-sizing heuristics
نویسندگان
چکیده
منابع مشابه
Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...
متن کاملImproved formulations, heuristics and metaheuristics for the dynamic demand coordinated lot-sizing problem
Improved Formulations, Heuristics and Metaheuristics for the Dynamic Demand Coordinated Lot-sizing Problem. (August 2006) Arunachalam Narayanan, B.E., Anna University, India; M.S., Texas A&M University Chair of Advisory Committee: Dr. E. Powell Robinson Coordinated lot sizing problems, which assume a joint setup is shared by a product family, are commonly encountered in supply chain contexts. T...
متن کاملMeta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combination...
متن کاملDynamic knapsack sets and capacitated lot-sizing
A dynamic knapsack set is a natural generalization of the 0-1 knapsack set with a continuous variable studied recently. For dynamic knapsack sets a large family of facet-defining inequalities, called dynamic knapsack inequalities, are derived by fixing variables to one and then lifting. Surprisingly such inequalities have the simultaneous lifting property, and for small instances provide a sign...
متن کاملSome New Dynamic Economic Lot Sizing Models
We introduce a dynamic economic lot sizing problem whose production cost considers both setup and the designed-and-yet stretchable production capacity. Demands and the control on production activities drive the evolution of the production system. We give a pseudo-polynomial algorithm for the problem when future demands are known. When there is uncertainty in future demands and there is no holdi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Production & Manufacturing Research
سال: 2015
ISSN: 2169-3277
DOI: 10.1080/21693277.2014.985390